Continuous Latent Spaces Sampling for Graph Autoencoder
نویسندگان
چکیده
This paper proposes colaGAE, a self-supervised learning framework for graph-structured data. While graph autoencoders (GAEs) commonly use reconstruction as pretext task, this simple approach often yields poor model performance. To address issue, colaGAE employs mutual isomorphism task continuous latent space sampling GAE (colaGAE). The central idea of is to sample from multiple views in the and reconstruct structure, with significant improvements terms model’s training difficulty. investigate whether can enhance GAEs’ representations, we provide both theoretical empirical evidence benefits task. Theoretically, prove that offer respect difficulty training, leading better Empirically, conduct extensive experiments on eight benchmark datasets achieve four state-of-the-art (SOTA) results; average accuracy rate experiences notable enhancement 0.3%, demonstrating superiority node classification tasks.
منابع مشابه
Adversarially Regularized Graph Autoencoder
Graph embedding is an eective method to represent graph data in a low dimensional space for graph analytics. Most existing embedding algorithms typically focus on preserving the topological structure or minimizing the reconstruction errors of graph data, but they have mostly ignored the data distribution of the latent codes from the graphs, which oen results in inferior embedding in real-worl...
متن کاملAutoencoder Node Saliency: Selecting Relevant Latent Representations
The autoencoder is an artificial neural network that learns hidden representations of unlabeled data. With a linear transfer function it is similar to the principal component analysis (PCA). While both methods use weight vectors for linear transformations, the autoencoder does not come with any indication similar to the eigenvalues in PCA that are paired with eigenvectors. We propose a novel su...
متن کاملTransformer fault diagnosis using continuous sparse autoencoder.
This paper proposes a novel continuous sparse autoencoder (CSAE) which can be used in unsupervised feature learning. The CSAE adds Gaussian stochastic unit into activation function to extract features of nonlinear data. In this paper, CSAE is applied to solve the problem of transformer fault recognition. Firstly, based on dissolved gas analysis method, IEC three ratios are calculated by the con...
متن کاملMarginalized Denoising Autoencoder via Graph Regularization for Domain Adaptation
Domain adaptation, which aims to learn domain-invariant features for sentiment classification, has received increasing attention. The underlying rationality of domain adaptation is that the involved domains share some common latent factors. Recently neural network based on Stacked Denoising Auto-Encoders (SDA) and its marginalized version (mSDA) have shown promising results on learning domain-i...
متن کاملJunction Tree Variational Autoencoder for Molecular Graph Generation
We seek to automate the design of molecules based on specific chemical properties. In computational terms, this task involves continuous embedding and generation of molecular graphs. Our primary contribution is the direct realization of molecular graphs, a task previously approached by generating linear SMILES strings instead of graphs. Our junction tree variational autoencoder generates molecu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied sciences
سال: 2023
ISSN: ['2076-3417']
DOI: https://doi.org/10.3390/app13116491